The flooding time in random graphs
نویسندگان
چکیده
Based on our analysis of the hopcount of the shortest path between two arbitrary nodes in the class Gp(N) of random graphs, the corresponding ßooding time is investigated. The ßooding time TN(p) is the minimum time needed to reach all other nodes from one node. We show that, after scaling, the ßooding time TN(p) converges in distribution to the two-fold convolution Λ(2∗) of the Gumbel distribution function Λ(z) = exp(−e−z), when the link density pN satisÞes NpN (log N)3 →∞ if N →∞.
منابع مشابه
Flooding in Weighted Random Graphs
In this paper, we study the impact of edge weights on distances in diluted random graphs. We interpret these weights as delays, and take them as i.i.d exponential random variables. We analyze the weighted flooding time defined as the minimum time needed to reach all nodes from one uniformly chosen node, and the weighted diameter corresponding to the largest distance between any pair of vertices...
متن کاملOn Complexity of Flooding Games on Graphs with Interval Representations
The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider the coloring ga...
متن کاملDynamic Search Algorithm used in Unstructured Peer-to-Peer Networks
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...
متن کاملOn the evaluation of flooding-based search strategies in peer-to-peer networks
This paper develops a directed generalized random graphs based analytical modeling framework to compare several variations of the basic flooding search strategy in unstructured decentralized peer-topeer networks. To validate the model predictions, we designed and implemented a distributed crawler architecture that is able to efficiently capture snapshots of the top-level Gnutella overlay topolo...
متن کاملDynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002